A ð t ; n Þ multi - secret sharing scheme q
نویسندگان
چکیده
10 In the ðt; nÞ multi-secret sharing scheme, there are n participants in the system. At 11 least t or more participants can easily pool their secrets shadows and reconstruct p 12 secrets at the same time. Chien et al. [IEICE Trans. Fundamentals E83-A (2000) 2762] 13 used (nþ p t þ 1) public values, ð2ðnþ pÞ tÞ ðnþ pÞ storages, and solved (nþ 14 p t) simultaneous equations to share p secrets. In this article, we shall propose an 15 alternative ðt; nÞ multi-secret sharing based on Shamir s secret sharing. We shall use 16 (nþ p t þ 1) or (nþ 1) public values, 2ðt 1Þ or 2ðp 1Þ storages, and employ the 17 Lagrange interpolation polynomial to share p secrets. Our scheme will have exactly the 18 same power as Chien et al. s scheme. 19 2003 Elsevier Science Inc. All rights reserved. 20
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode
In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کامل